Cloning Voronoi Diagrams via Retroactive Data Structures
نویسندگان
چکیده
We address the problem of replicating a Voronoi diagram V (S) of a planar point set S by making proximity queries: 1. the exact location of the nearest site(s) in S 2. the distance to and label(s) of the nearest site(s) in S 3. a unique label for every nearest site in S. In addition to showing the limits of nearest-neighbor database security, our methods also provide one of the first natural algorithmic applications of retroactive data structures.
منابع مشابه
Indexing Network Voronoi Diagrams
The Network Voronoi diagram and its variants have been extensively used in the context of numerous applications in road networks, particularly to efficiently evaluate various spatial proximity queries such as k nearest neighbor (kNN), reverse kNN, and closest pair. Although the existing approaches successfully utilize the network Voronoi diagram as a way to partition the space for their specifi...
متن کاملDynamic Spatial Data Structures - the Voronoi Approach
Voronoi diagrams have recently received attention as data structures containing significant information about the spatial adjacency of map objects. Despite their theoretical efficiency, batch construction techniques require complete rebuilding after each modification. Incremental Voronoi creation methods use processes such as insert, delete and move for points, and from these derive insertion a...
متن کاملAn Interactive Tour of Voronoi Diagrams on the GPU
Voronoi diagrams are fundamental geometric structures that have been both deeply and widely investigated since their inception in disguise by René Descartes for analyzing the gravitational influence of stars, in the 17 century. Voronoi diagrams find countless applications in science and engineering beyond graphics as attested by the long representative, and yet non-exhaustive, list of applicati...
متن کاملNet-aware Critical Area extraction for VLSI opens via Voronoi diagrams
We address the problem of computing critical area for opens in a circuit layout in the presence of loops and redundant interconnects. The extraction of critical area is the main computational problem in VLSI yield prediction for random manufacturing defects. Our approach first models the problem as a graph problem and solves it efficiently by exploiting its geometric nature. The approach expand...
متن کاملVoronoi Diagrams in Linear Time ∗
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010